Interblock Information from BIBD Mixed Effects
نویسندگان
چکیده
منابع مشابه
Multiresolution Interblock Interpolation in Direct Volume Rendering
We present a direct interblock interpolation technique that enables direct volume rendering of blocked, multiresolution volumes. The proposed method smoothly interpolates between blocks of arbitrary block-wise level-of-detail (LOD) without sample replication or padding. This permits extreme changes in resolution across block boundaries and removes the interblock dependency for the LOD creation ...
متن کاملA coded modulation scheme with interblock memory
A bstract-In this paper, we propose a coded modulationi scheme with interblock memory. The proposed scheme has a multi-stage coding structure. However, at some coding stage, the coding designs for every two adjacent blocks are related. Compared to coded modulation schemes for which each block is independent of the others, the introduction of interblock coding provides us with additional flexibi...
متن کاملThreshold Effects in Sticky Information Philips Curve: Evidence from Iran
During the last decade, several studies have argued that sticky information model proposed by Mankiw and Reis (2002), in which firms update their information occasionally rather than instantaneously, explains some stylized facts about the inflation dynamics. Sticky information pricing model successfully captures the sluggish movement of aggregate prices in response to monetary policy shocks. De...
متن کاملA 2 -code = Aane Resolvable + Bibd
We say that an A 2-code is optimum if it has the minimum cheating probabilities and the minimum sizes of keys. We rst show that an optimum A 2-code implies an aane-resolvable design. Next, we de-ne an aane-resolvable + BIBD design and prove that an optimum A 2-code is equivalent to an aane-resolvable + BIBD design.
متن کاملExistentially Closed BIBD Block-Intersection Graphs
A graph G with vertex set V is said to be n-existentially closed if, for every S ⊂ V with |S| = n and every T ⊆ S, there exists a vertex x ∈ V − S such that x is adjacent to each vertex of T but is adjacent to no vertex of S − T . Given a combinatorial design D with block set B, its block-intersection graph GD is the graph having vertex set B such that two vertices b1 and b2 are adjacent if and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Korean Journal of Applied Statistics
سال: 2015
ISSN: 1225-066X
DOI: 10.5351/kjas.2015.28.2.151